منابع مشابه
Modularity of Confluence - Constructed
We present a novel proof of Toyama’s famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in that it factors through the decreasing diagrams technique for abstract rewriting systems, is constructive in that it gives a construction for the converging rewrite sequences given a pair of diverging rewrite sequences, and ...
متن کاملModularity of Constructive Confluence
We prove modularity of constructive confluence for term rewriting systems using a novel decomposition of terms into tall aliens and bases. The proof is modular itself in that it factors through the decreasing diagrams theorem for abstract rewriting systems.
متن کاملDiagrammatic confluence for Constraint Handling Rules
Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper we are concerned with proving the confluence of nonterminating CHR programs. For this purpose, we derive...
متن کاملModularity of Confluence: A Simplified Proof
In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting systems is confluent. 1985 Mathematics Subject Classification: 68Q5
متن کاملProgramming 1 Diagrammatic confluence for Constraint Handling Rules ∗
Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper we are concerned with proving the confluence of nonterminating CHR programs. For this purpose, we derive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.030